The Union of Convex Polyhedra in Three Dimensions

We show that the number of vertices, edges, and faces of the union of k convex polyhedra in 3-space, having a total of n faces, is O(k + kn log k). This bound is almost tight in the worst case, as there exist collections of polyhedra with Ω(k + knα(k)) union complexity. We also describe a rather simple randomized incremental algorithm for computing the boundary of the union in O(k + kn log k logn) expected time.